Geometry optimization in redundant internal coordinates
نویسندگان
چکیده
The gradient geometry-optimization procedure is reformulated in terms of redundant internal coordinates. By replacing the matrix inverse with the generalized inverse, the usual NewtonRaphson-type algorithms can be formulated in exactly the same way for redundant and nonredundant coordinates. Optimization in redundant coordinates is particularly useful for bridged polycyclic compounds and cage structures where it is difficult to define physically reasonable redundancy-free internal coordinates. This procedure, already used for the geometry optimization of porphine, C20N4H w is illustrated here at the ab initio self-consistentfield level for the four-membered ring azetidine, for bicyclo[2.2.2]octane, and for the four-ring system C I60 2Hw the skeleton of taxol.
منابع مشابه
Introduction to Traditional Geometry Optimization Methods (supporting Documentation for Our Poster at Watoc '99 Entitled " Efficient Methods for Geometry Optimization of Large Molecules " )
Optimization of the structures of large molecules by quantum chemical methods requires stable, efficient, and therefore, elaborate optimization algorithms, usually in the framework of an over-complete, redundant internal coordinate system. Since the derivatives of the energy are calculated with respect to the Cartesian coordinates of the nuclei, they must be transformed into the internal coordi...
متن کاملGlobal geometry optimization of atomic clusters using a modified genetic algorithm in spacefixed coordinates
͑1996͔͒ proposed a global geometry optimization technique using a modified Genetic Algorithm approach for clusters. They refer to their technique as a deterministic/ stochastic genetic algorithm ͑DS-GA͒. In this technique, the stochastic part is a traditional GA, with the manipulations being carried out on binary-coded internal coordinates ͑atom–atom distances͒. The deterministic aspect of their metho...
متن کاملSIZE AND GEOMETRY OPTIMIZATION OF TRUSS STRUCTURES USING THE COMBINATION OF DNA COMPUTING ALGORITHM AND GENERALIZED CONVEX APPROXIMATION METHOD
In recent years, the optimization of truss structures has been considered due to their several applications and their simple structure and rapid analysis. DNA computing algorithm is a non-gradient-based method derived from numerical modeling of DNA-based computing performance by new computers with DNA memory known as molecular computers. DNA computing algorithm works based on collective intelli...
متن کاملGeometry optimization of periodic systems using internal coordinates.
An algorithm is proposed for the structural optimization of periodic systems in internal (chemical) coordinates. Internal coordinates may include in addition to the usual bond lengths, bond angles, out-of-plane and dihedral angles, various "lattice internal coordinates" such as cell edge lengths, cell angles, cell volume, etc. The coordinate transformations between Cartesian (or fractional) and...
متن کاملGeometry optimization in density functional methods
The geometry optimization in delocalized internal coordinates is discussed within the framework of the density functional theory program deMon. A new algorithm for the selection of primitive coordinates according to their contribution to the nonredundant coordinate space is presented. With this new selection algorithm the excessive increase in computational time and the deterioration of the per...
متن کامل